Multiplicative Relations in Powers of Euler’s Product
نویسندگان
چکیده
In a recent paper, Cooper and Hirschhorn conjecture relations among the coefficients of certain products of powers of Euler’s product. Here we use the theory of modular forms with complex multiplication to prove these conjectures.
منابع مشابه
Powers of Euler’s Product and Related Identities
Ramanujan’s partition congruences can be proved by first showing that the coefficients in the expansions of (q; q)∞ satisfy certain divisibility properties when r = 4, 6 and 10. We show that much more is true. For these and other values of r , the coefficients in the expansions of (q; q)∞ satisfy arithmetic relations, and these arithmetic relations imply the divisibility properties referred to ...
متن کاملComputing the inverses, their power sums, and extrema for Euler's totient and other multiplicative functions
Wepropose a generic dynamic programming algorithm for computing the inverses of a multiplicative function. We illustrate our algorithm with Euler’s totient function and the sum of k-th powers of divisors. Our approach can be further adapted for computing certain functions of the inverses, such as their quantity, the smallest/largest inverse, which may be computed faster than the inverses themse...
متن کاملThe ratio and product of the multiplicative Zagreb indices
The first multiplicative Zagreb index $Pi_1(G)$ is equal to the product of squares of the degree of the vertices and the second multiplicative Zagreb index $Pi_2(G)$ is equal to the product of the products of the degree of pairs of adjacent vertices of the underlying molecular graphs $G$. Also, the multiplicative sum Zagreb index $Pi_3(G)$ is equal to the product of the sum...
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملA Formalisation of Lehmer’s Primality Criterion
In 1927, Lehmer presented criterions for primality, based on the converse of Fermat’s litte theorem [2]. This work formalizes the second criterion from Lehmer’s paper, a necessary and sufficient condition for primality. As a side product we formalize some properties of Euler’s φ-function, the notion of the order of an element of a group, and the cyclicity of the multiplicative group of a finite...
متن کامل